Gauss-Radau Quadrature Rule Using Special Class of Polynomials

نویسندگان

  • M. A. Bokhari
  • Asghar Qadir
چکیده

A form of Gauss-Quadrature rule over [0,1] has been investigated that involves the derivative of the integrand at the pre-assigned left or right end node. This situation arises when the underlying polynomials are orthogonal with respect to the weight function (): 1 x x ω = − over [0,1]. Along the lines of Golub's work, the nodes and weights of the quadrature rule are computed from a Jacobi-type matrix with entries related to simple rational sequences. The structure of these sequences is based on some characteristics of the identity-type polynomials recently developed by one of the authors. The devised rule has a slight advantage over that subject to the weight function (): 1. x ω =

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Gauss-Radau and Gauss-Lobatto Numerical Integrations Over a Four Node Quadrilateral Finite Element

In this paper Gauss-Radau and Gauss-Lobatto quadrature rules are presented to evaluate the rational integrals of the element matrix for a general quadrilateral. These integrals arise in finite element formulation for second order Partial Differential Equation via Galerkin weighted residual method in closed form. Convergence to the analytical solutions and efficiency are depicted by numerical ex...

متن کامل

The structure of matrices in rational Gauss quadrature

This paper is concerned with the approximation of matrix functionals defined by a large, sparse or structured, symmetric definite matrix. These functionals are Stieltjes integrals with a measure supported on a compact real interval. Rational Gauss quadrature rules that are designed to exactly integrate Laurent polynomials with a fixed pole in the vicinity of the support of the measure may yield...

متن کامل

Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials

Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the interpolation points. Few explicit formulae for these barycentric weights are known. In [H. Wang and S. Xiang, Math. Comp., 81 (2012), 861–877], the authors have shown t...

متن کامل

ORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS

Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...

متن کامل

Matrices, Moments, and Rational Quadrature

Abstract. Many problems in science and engineering require the evaluation of functionals of the form Fu(A) = uT f(A)u, where A is a large symmetric matrix, u a vector, and f a nonlinear function. A popular and fairly inexpensive approach to determining upper and lower bounds for such functionals is based on first carrying out a few steps of the Lanczos procedure applied to A with initial vector...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007